Hereditary equality of domination and exponential domination
نویسندگان
چکیده
منابع مشابه
On exponential domination and graph operations
An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....
متن کاملDomination with exponential decay
Let G be a graph and S ⊆ V (G). For each vertex u ∈ S and for each v ∈ V (G) − S, we define d(u, v) = d(v, u) to be the length of a shortest path in 〈V (G)−(S−{u})〉 if such a path exists, and∞ otherwise. Let v ∈ V (G). We define wS(v) = ∑ u∈S 1 2d(u,v)−1 if v 6∈ S, and wS(v) = 2 if v ∈ S. If, for each v ∈ V (G), we have wS(v) ≥ 1, then S is an exponential dominating set. The smallest cardinalit...
متن کاملHereditary Domination & Independence Parameters
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for ...
متن کاملHereditary domination and independence parameters
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for ...
متن کاملDomination in distance-hereditary graphs
The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2018
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2006